Approximate parametrization of plane algebraic curves by linear systems of curves
نویسندگان
چکیده
It is well known that an irreducible algebraic curve is rational (i.e. parametric) if and only if its genus is zero. In this paper, given a tolerance ǫ > 0 and an ǫ-irreducible algebraic affine plane curve C of proper degree d, we introduce the notion of ǫ-rationality, and we provide an algorithm to parametrize approximately affine ǫ-rational plane curves, without exact singularities at infinity, by means of linear systems of (d − 2)-degree curves. The algorithm outputs a rational parametrization of a rational curve C of degree at most d which has the same points at infinity as C. Moreover, although we do not provide a theoretical analysis, our empirical analysis shows that C and C are close in practice. ∗Authors partially supported by the Spanish Ministerio de Educación y Ciencia under the Project MTM2005-08690-C02-01.
منابع مشابه
Rational Hausdorff divisors: A new approach to the approximate parametrization of curves
In this paper we introduce the notion of rational Hausdorff divisor, we analyze the dimension and irreducibility of its associated linear system of curves, and we prove that all irreducible real curves belonging to the linear system are rational and are at finite Hausdorff distance among them. As a consequence, we provide a projective linear subspace where all (irreducible) elements are solutio...
متن کاملParametrization of approximate algebraic curves by lines
It is well known that irreducible algebraic plane curves having a singularity of maximum multiplicity are rational and can be parametrized by lines. In this paper, given a tolerance ¿ 0 and an -irreducible algebraic plane curve C of degree d having an -singularity of multiplicity d−1, we provide an algorithm that computes a proper parametrization of a rational curve that is exactly parametrizab...
متن کاملReal Parametrization of Algebraic Curves
There are various algorithms known for deciding the parametrizability (rationality) of a plane algebraic curve, and if the curve is rational, actually computing a parametrization. Optimality criteria such as low degrees in the parametrization or low degree field extensions are met by some parametrization algorithms. In this paper we investigate real curves. Given a parametrizable plane curve ov...
متن کاملAlgorithms for Rational Real Algebraic Curves
In this paper, we study fundamental properties of real curves, especially of rational real curves, and we derive several algorithms to decide the reality and rationality of curves in the complex plane. Furthermore, if the curve is real and rational, we determine a real parametrization. More precisely, we present a reality test algorithm for plane curves, and three different types of real parame...
متن کاملSymbolic Parametrization of Curves
If algebraic varieties like curves or surfaces are to be manipulated by computers, it is essential to be able to represent these geometric objects in an appropriate way. For some applications an implicit representation by algebraic equations is desirable, whereas for others an explicit or parametric representation is more suitable. Therefore, transformation algorithms from one representation to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Aided Geometric Design
دوره 27 شماره
صفحات -
تاریخ انتشار 2010